Spiral curve based vertical parking planner system for autonomous driving vehicles

ABSTRACT

In one embodiment, a path for parking is planned in operating an autonomous driving vehicle (ADV). The operations comprises: determining a plurality of sample points; determining a plurality of candidate paths connecting a start point and an end point for parking, each of the candidate paths passing through one of the sample points; determining a cost associated with each of the plurality of candidate paths; determining one or more candidate paths from the plurality of candidate paths that meet a boundary check requirement; selecting as the planned path a candidate path associated with a lowest cost that meets the boundary check requirement; determining a speed profile based on the planned path and an environment of the ADV; and generating driving signals based at least in part on the speed profile to control operations of the ADV to perform parking along the planned path.

TECHNICAL FIELD

Embodiments of the present disclosure relate generally to operating autonomous vehicles. More particularly, embodiments of the disclosure relate to path planning for vertical parking in an autonomous driving vehicle.

BACKGROUND

Vehicles operating in an autonomous mode (e.g., driverless) can relieve occupants, especially the driver, from some driving-related responsibilities. When operating in an autonomous mode, the vehicle can navigate to various locations using onboard sensors, allowing the vehicle to travel with minimal human interaction or in some cases without any passengers.

Vertical parking (also known as perpendicular parking, i.e., the vehicle backs into the parking space, and once parked, the heading of the parked vehicle is perpendicular to the travel direction of the road lane where the vehicle initiated the parking maneuvers) is a complicated movement in an autonomous driving vehicle. Planning for vertical parking by an autonomous vehicle is significantly different from normal route planning.

SUMMARY

In an aspect of the disclosure, a computer-implemented method for planning a path for parking in operating an autonomous driving vehicle (ADV) is provided. The method includes: defining a plurality of sample points as intermediate points between a start point and an end point within a parking space to park the ADV; determining a plurality of candidate paths connecting the start point and the end point through each of the sample points, wherein each of the candidate paths is defined as a spiral curve using a polynomial function; for each of the candidate paths, calculating a path cost using a predetermined cost function; selecting one of the candidate paths having a lowest path cost amongst the candidate paths; and planning a trajectory according to the selected candidate path to park the ADV into the parking space.

In another aspect of the disclosure, a non-transitory machine-readable medium having instructions stored therein is provided. The instructions when executed by a processor cause the processor to perform operations for planning a path for parking in operating an autonomous driving vehicle (ADV), the operations including: defining a plurality of sample points as intermediate points between a start point and an end point within a parking space to park the ADV; determining a plurality of candidate paths connecting the start point and the end point through each of the sample points, wherein each of the candidate paths is defined as a spiral curve using a polynomial function; for each of the candidate paths, calculating a path cost using a predetermined cost function; selecting one of the candidate paths having a lowest path cost amongst the candidate paths; and planning a trajectory according to the selected candidate path to park the ADV into the parking space.

In another aspect of the disclosure, a data processing system is provided. The system includes a processor; and a memory coupled to the processor to store instructions, which when executed by the processor, cause the processor to perform operations for planning a path for parking in operating an autonomous driving vehicle (ADV), the operations including: defining a plurality of sample points as intermediate points between a start point and an end point within a parking space to park the ADV, determining a plurality of candidate paths connecting the start point and the end point through each of the sample points, wherein each of the candidate paths is defined as a spiral curve using a polynomial function, for each of the candidate paths, calculating a path cost using a predetermined cost function, selecting one of the candidate paths having a lowest path cost amongst the candidate paths, and planning a trajectory according to the selected candidate path to park the ADV into the parking space.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the disclosure are illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.

FIG. 1 is a block diagram illustrating a networked system according to one embodiment.

FIG. 2 is a block diagram illustrating an example of an autonomous vehicle according to one embodiment.

FIGS. 3A-3B are block diagrams illustrating an example of a perception and planning system used with an autonomous vehicle according to one embodiment.

FIG. 4 is a block diagram illustrating various modules according to one embodiment.

FIG. 5 is a diagram illustrating an environment where embodiments may be practiced.

FIG. 6 is a flowchart illustrating an example method for planning a path for vertical parking in operating an autonomous driving vehicle (ADV) according to one embodiment.

FIG. 7 is a block diagram illustrating a data processing system according to one embodiment.

DETAILED DESCRIPTION

Various embodiments and aspects of the disclosures will be described with reference to details discussed below, and the accompanying drawings will illustrate the various embodiments. The following description and drawings are illustrative of the disclosure and are not to be construed as limiting the disclosure. Numerous specific details are described to provide a thorough understanding of various embodiments of the present disclosure. However, in certain instances, well-known or conventional details are not described in order to provide a concise discussion of embodiments of the present disclosures.

Reference in the specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in conjunction with the embodiment can be included in at least one embodiment of the disclosure. The appearances of the phrase “in one embodiment” in various places in the specification do not necessarily all refer to the same embodiment.

According to some embodiments, a path for parking into a parking space is planned in operating an autonomous driving vehicle (ADV). A number of sample points are determined as intermediate points, which are disposed between a start point representing a current location of the ADV and an end point within the parking space. The sample points are located on a line that forms a 45-degree angle with a direction of a road lane in which the start point is located. In one embodiment, the line intersects with a corner between the road lane and the parking space. A number of candidate paths connecting the start point and the end point for parking are determined, each of the candidate paths passing through one of the sample points. Each candidate path includes two connected spiral curves having a first spiral curve connecting the start point and the respective sample point and a second spiral curve connecting the respective sample point and the end point. The first spiral curve is associated with a forward movement of the ADV, and the second spiral curve is associated with a reverse movement of the ADV.

A path cost associated with each of the candidate paths is determined using a predetermined cost function. One or more candidate paths from the plurality of candidate paths that meet a boundary check requirement are determined. That is, in order to for a candidate path to be considered as the final parking path, the candidate path has to satisfy the boundary requirement of the current driving environment such as lane configuration restraints. Otherwise, it will be removed from the pool of candidate paths for consideration. A candidate path associated with a lowest cost that meets the boundary check requirement is selected as the planned path. A speed profile based on the planned path and an environment of the ADV is determined. Further, driving signals are generated based at least in part on the speed profile to control operations of the ADV to perform vertical parking along the planned path. The ADV travels along the first spiral curve of the planned path in the forward direction, and along the second spiral curve of the planned path in the reverse direction.

In one embodiment, a same distance separates any two neighboring sample points (e.g., evenly distributed along the line). In one embodiment, the first and second spiral curves are quintic spiral curves. In one embodiment, the cost comprises an obstacle cost, and is determined based at least in part on a distance between the ADV and each of one or more obstacles in a vicinity of the respective candidate path (e.g., the distance between each of the obstacles and the candidate path is shorter than a threshold). In one embodiment, determining the speed profile comprises determining zero, one, or more stopping points along the planned path. In one embodiment, each of the start point, the end point, and the sample points is associated with a coordinate on a map and a heading. The start point is further associated with a speed and an acceleration of the ADV at the start point, which normally represents the current location of the ADV.

FIG. 1 is a block diagram illustrating an autonomous vehicle network configuration according to one embodiment of the disclosure. Referring to FIG. 1, network configuration 100 includes autonomous vehicle 101 that may be communicatively coupled to one or more servers 103-104 over a network 102. Although there is one autonomous vehicle shown, multiple autonomous vehicles can be coupled to each other and/or coupled to servers 103-104 over network 102. Network 102 may be any type of networks such as a local area network (LAN), a wide area network (WAN) such as the Internet, a cellular network, a satellite network, or a combination thereof, wired or wireless. Server(s) 103-104 may be any kind of servers or a cluster of servers, such as Web or cloud servers, application servers, backend servers, or a combination thereof. Servers 103-104 may be data analytics servers, content servers, traffic information servers, map and point of interest (MPOI) servers, or location servers, etc.

An autonomous vehicle refers to a vehicle that can be configured to in an autonomous mode in which the vehicle navigates through an environment with little or no input from a driver. Such an autonomous vehicle can include a sensor system having one or more sensors that are configured to detect information about the environment in which the vehicle operates. The vehicle and its associated controller(s) use the detected information to navigate through the environment. Autonomous vehicle 101 can operate in a manual mode, a full autonomous mode, or a partial autonomous mode.

In one embodiment, autonomous vehicle 101 includes, but is not limited to, perception and planning system 110, vehicle control system 111, wireless communication system 112, user interface system 113, infotainment system 114, and sensor system 115. Autonomous vehicle 101 may further include certain common components included in ordinary vehicles, such as, an engine, wheels, steering wheel, transmission, etc., which may be controlled by vehicle control system 111 and/or perception and planning system 110 using a variety of communication signals and/or commands, such as, for example, acceleration signals or commands, deceleration signals or commands, steering signals or commands, braking signals or commands, etc.

Components 110-115 may be communicatively coupled to each other via an interconnect, a bus, a network, or a combination thereof. For example, components 110-115 may be communicatively coupled to each other via a controller area network (CAN) bus. A CAN bus is a vehicle bus standard designed to allow microcontrollers and devices to communicate with each other in applications without a host computer. It is a message-based protocol, designed originally for multiplex electrical wiring within automobiles, but is also used in many other contexts.

Referring now to FIG. 2, in one embodiment, sensor system 115 includes, but it is not limited to, one or more cameras 211, global positioning system (GPS) unit 212, inertial measurement unit (IMU) 213, radar unit 214, and a light detection and range (LIDAR) unit 215. GPS system 212 may include a transceiver operable to provide information regarding the position of the autonomous vehicle. IMU unit 213 may sense position and orientation changes of the autonomous vehicle based on inertial acceleration. Radar unit 214 may represent a system that utilizes radio signals to sense objects within the local environment of the autonomous vehicle. In some embodiments, in addition to sensing objects, radar unit 214 may additionally sense the speed and/or heading of the objects. LIDAR unit 215 may sense objects in the environment in which the autonomous vehicle is located using lasers. LIDAR unit 215 could include one or more laser sources, a laser scanner, and one or more detectors, among other system components. Cameras 211 may include one or more devices to capture images of the environment surrounding the autonomous vehicle. Cameras 211 may be still cameras and/or video cameras. A camera may be mechanically movable, for example, by mounting the camera on a rotating and/or tilting a platform.

Sensor system 115 may further include other sensors, such as, a sonar sensor, an infrared sensor, a steering sensor, a throttle sensor, a braking sensor, and an audio sensor (e.g., microphone). An audio sensor may be configured to capture sound from the environment surrounding the autonomous vehicle. A steering sensor may be configured to sense the steering angle of a steering wheel, wheels of the vehicle, or a combination thereof. A throttle sensor and a braking sensor sense the throttle position and braking position of the vehicle, respectively. In some situations, a throttle sensor and a braking sensor may be integrated as an integrated throttle/braking sensor.

In one embodiment, vehicle control system 111 includes, but is not limited to, steering unit 201, throttle unit 202 (also referred to as an acceleration unit), and braking unit 203. Steering unit 201 is to adjust the direction or heading of the vehicle. Throttle unit 202 is to control the speed of the motor or engine that in turn control the speed and acceleration of the vehicle. Braking unit 203 is to decelerate the vehicle by providing friction to slow the wheels or tires of the vehicle. Note that the components as shown in FIG. 2 may be implemented in hardware, software, or a combination thereof.

Referring back to FIG. 1, wireless communication system 112 is to allow communication between autonomous vehicle 101 and external systems, such as devices, sensors, other vehicles, etc. For example, wireless communication system 112 can wirelessly communicate with one or more devices directly or via a communication network, such as servers 103-104 over network 102. Wireless communication system 112 can use any cellular communication network or a wireless local area network (WLAN), e.g., using WiFi to communicate with another component or system. Wireless communication system 112 could communicate directly with a device (e.g., a mobile device of a passenger, a display device, a speaker within vehicle 101), for example, using an infrared link, Bluetooth, etc. User interface system 113 maybe part of peripheral devices implemented within vehicle 101 including, for example, a keyboard, a touch screen display device, a microphone, and a speaker, etc.

Some or all of the functions of autonomous vehicle 101 may be controlled or managed by perception and planning system 110, especially when operating in an autonomous driving mode. Perception and planning system 110 includes the necessary hardware (e.g., processor(s), memory, storage) and software (e.g., operating system, planning and routing programs) to receive information from sensor system 115, control system 111, wireless communication system 112, and/or user interface system 113, process the received information, plan a route or path from a starting point to a destination point, and then drive vehicle 101 based on the planning and control information. Alternatively, perception and planning system 110 may be integrated with vehicle control system 111.

For example, a user as a passenger may specify a starting location and a destination of a trip, for example, via a user interface. Perception and planning system 110 obtains the trip related data. For example, perception and planning system 110 may obtain location and route information from an MPOI server, which may be a part of servers 103-104. The location server provides location services and the MPOI server provides map services and the POIs of certain locations. Alternatively, such location and MPOI information may be cached locally in a persistent storage device of perception and planning system 110.

While autonomous vehicle 101 is moving along the route, perception and planning system 110 may also obtain real-time traffic information from a traffic information system or server (TIS). Note that servers 103-104 may be operated by a third party entity. Alternatively, the functionalities of servers 103-104 may be integrated with perception and planning system 110. Based on the real-time traffic information, MPOI information, and location information, as well as real-time local environment data detected or sensed by sensor system 115 (e.g., obstacles, objects, nearby vehicles), perception and planning system 110 can plan an optimal route and drive vehicle 101, for example, via control system 111, according to the planned route to reach the specified destination safely and efficiently.

Server 103 may be a data analytics system to perform data analytics services for a variety of clients. In one embodiment, data analytics system 103 includes data collector 121 and machine learning engine 122. Data collector 121 collects driving statistics 123 from a variety of vehicles, either autonomous vehicles or regular vehicles driven by human drivers. Driving statistics 123 include information indicating the driving commands (e.g., throttle, brake, steering commands) issued and responses of the vehicles (e.g., speeds, accelerations, decelerations, directions) captured by sensors of the vehicles at different points in time. Driving statistics 123 may further include information describing the driving environments at different points in time, such as, for example, routes (including starting and destination locations), MPOIs, road conditions, weather conditions, etc.

Based on driving statistics 123, machine learning engine 122 generates or trains a set of rules, algorithms, and/or predictive models 124 for a variety of purposes. In one embodiment, algorithms 124 may include an algorithm for planning a path for parking of an ADV, such as, for example, a cost function for calculating a path cost and/or a polynomial function to draw a path, as well as path selection rules. Algorithms 124 can then be uploaded on ADVs to be utilized during autonomous driving in real-time.

FIGS. 3A and 3B are block diagrams illustrating an example of a perception and planning system used with an autonomous vehicle according to one embodiment. System 300 may be implemented as a part of autonomous vehicle 101 of FIG. 1 including, but is not limited to, perception and planning system 110, control system 111, and sensor system 115. Referring to FIGS. 3A-3B, perception and planning system 110 includes, but is not limited to, localization module 301, perception module 302, prediction module 303, decision module 304, planning module 305, control module 306, routing module 307, and vertical parking planning module 308.

Some or all of modules 301-308 may be implemented in software, hardware, or a combination thereof. For example, these modules may be installed in persistent storage device 352, loaded into memory 351, and executed by one or more processors (not shown). Note that some or all of these modules may be communicatively coupled to or integrated with some or all modules of vehicle control system 111 of FIG. 2. Some of modules 301-308 may be integrated together as an integrated module. For example, parking module 308 may be implemented or integrated as a part of planning module 305.

Localization module 301 determines a current location of autonomous vehicle 300 (e.g., leveraging GPS unit 212) and manages any data related to a trip or route of a user. Localization module 301 (also referred to as a map and route module) manages any data related to a trip or route of a user. A user may log in and specify a starting location and a destination of a trip, for example, via a user interface. Localization module 301 communicates with other components of autonomous vehicle 300, such as map and route information 311, to obtain the trip related data. For example, localization module 301 may obtain location and route information from a location server and a map and POI (MPOI) server. A location server provides location services and an MPOI server provides map services and the POIs of certain locations, which may be cached as part of map and route information 311. While autonomous vehicle 300 is moving along the route, localization module 301 may also obtain real-time traffic information from a traffic information system or server.

Based on the sensor data provided by sensor system 115 and localization information obtained by localization module 301, a perception of the surrounding environment is determined by perception module 302. The perception information may represent what an ordinary driver would perceive surrounding a vehicle in which the driver is driving. The perception can include the lane configuration, traffic light signals, a relative position of another vehicle, a pedestrian, a building, crosswalk, or other traffic related signs (e.g., stop signs, yield signs), etc., for example, in a form of an object. The lane configuration includes information describing a lane or lanes, such as, for example, a shape of the lane (e.g., straight or curvature), a width of the lane, how many lanes in a road, one-way or two-way lane, merging or splitting lanes, exiting lane, etc.

Perception module 302 may include a computer vision system or functionalities of a computer vision system to process and analyze images captured by one or more cameras in order to identify objects and/or features in the environment of autonomous vehicle. The objects can include traffic signals, road way boundaries, other vehicles, pedestrians, and/or obstacles, etc. The computer vision system may use an object recognition algorithm, video tracking, and other computer vision techniques. In some embodiments, the computer vision system can map an environment, track objects, and estimate the speed of objects, etc. Perception module 302 can also detect objects based on other sensors data provided by other sensors such as a radar and/or LIDAR.

For each of the objects, prediction module 303 predicts what the object will behave under the circumstances. The prediction is performed based on the perception data perceiving the driving environment at the point in time in view of a set of map/rout information 311 and traffic rules 312. For example, if the object is a vehicle at an opposing direction and the current driving environment includes an intersection, prediction module 303 will predict whether the vehicle will likely move straight forward or make a turn. If the perception data indicates that the intersection has no traffic light, prediction module 303 may predict that the vehicle may have to fully stop prior to enter the intersection. If the perception data indicates that the vehicle is currently at a left-turn only lane or a right-turn only lane, prediction module 303 may predict that the vehicle will more likely make a left turn or right turn respectively.

For each of the objects, decision module 304 makes a decision regarding how to handle the object. For example, for a particular object (e.g., another vehicle in a crossing route) as well as its metadata describing the object (e.g., a speed, direction, turning angle), decision module 304 decides how to encounter the object (e.g., overtake, yield, stop, pass). Decision module 304 may make such decisions according to a set of rules such as traffic rules or driving rules 312, which may be stored in persistent storage device 352.

Routing module 307 is configured to provide one or more routes or paths from a starting point to a destination point. For a given trip from a start location to a destination location, for example, received from a user, routing module 307 obtains route and map information 311 and determines all possible routes or paths from the starting location to reach the destination location. Routing module 307 may generate a reference line in a form of a topographic map for each of the routes it determines from the starting location to reach the destination location. A reference line refers to an ideal route or path without any interference from others such as other vehicles, obstacles, or traffic condition. That is, if there is no other vehicle, pedestrians, or obstacles on the road, an ADV should exactly or closely follows the reference line. The topographic maps are then provided to decision module 304 and/or planning module 305. Decision module 304 and/or planning module 305 examine all of the possible routes to select and modify one of the most optimal routes in view of other data provided by other modules such as traffic conditions from localization module 301, driving environment perceived by perception module 302, and traffic condition predicted by prediction module 303. The actual path or route for controlling the ADV may be close to or different from the reference line provided by routing module 307 dependent upon the specific driving environment at the point in time.

Based on a decision for each of the objects perceived, planning module 305 plans a path or route for the autonomous vehicle, as well as driving parameters (e.g., distance, speed, and/or turning angle), using a reference line provided by routing module 307 as a basis. That is, for a given object, decision module 304 decides what to do with the object, while planning module 305 determines how to do it. For example, for a given object, decision module 304 may decide to pass the object, while planning module 305 may determine whether to pass on the left side or right side of the object. Planning and control data is generated by planning module 305 including information describing how vehicle 300 would move in a next moving cycle (e.g., next route/path segment). For example, the planning and control data may instruct vehicle 300 to move 10 meters at a speed of 30 mile per hour (mph), then change to a right lane at the speed of 25 mph.

Based on the planning and control data, control module 306 controls and drives the autonomous vehicle, by sending proper commands or signals to vehicle control system 111, according to a route or path defined by the planning and control data. The planning and control data include sufficient information to drive the vehicle from a first point to a second point of a route or path using appropriate vehicle settings or driving parameters (e.g., throttle, braking, steering commands) at different points in time along the path or route.

In one embodiment, the planning phase is performed in a number of planning cycles, also referred to as driving cycles, such as, for example, in every time interval of 100 milliseconds (ms). For each of the planning cycles or driving cycles, one or more control commands will be issued based on the planning and control data. That is, for every 100 ms, planning module 305 plans a next route segment or path segment, for example, including a target position and the time required for the ADV to reach the target position. Alternatively, planning module 305 may further specify the specific speed, direction, and/or steering angle, etc. In one embodiment, planning module 305 plans a route segment or path segment for the next predetermined period of time such as 5 seconds. For each planning cycle, planning module 305 plans a target position for the current cycle (e.g., next 5 seconds) based on a target position planned in a previous cycle. Control module 306 then generates one or more control commands (e.g., throttle, brake, steering control commands) based on the planning and control data of the current cycle.

Note that decision module 304 and planning module 305 may be integrated as an integrated module. Decision module 304/planning module 305 may include a navigation system or functionalities of a navigation system to determine a driving path for the autonomous vehicle. For example, the navigation system may determine a series of speeds and directional headings to affect movement of the autonomous vehicle along a path that substantially avoids perceived obstacles while generally advancing the autonomous vehicle along a roadway-based path leading to an ultimate destination. The destination may be set according to user inputs via user interface system 113. The navigation system may update the driving path dynamically while the autonomous vehicle is in operation. The navigation system can incorporate data from a GPS system and one or more maps so as to determine the driving path for the autonomous vehicle.

When an ADV is about to make a parking attempt into a parking space such as a vertical parking move, parking planning module 308 is invoked to plan a trajectory or path to park the ADV into the parking space using one or more parking algorithms 313. According to one embodiment, parking planning module 308 is configured to determine a set of parking path candidates, calculate a cost for each of the path candidates using a predetermined cost formula, and select one of the path candidates based on the cost to park the vehicle into the parking space.

According to one embodiment, parking module 308 defines a set of sample points as intermediate points between a start point of an ADV and an end point within a parking space or parking spot. A set of candidate paths are defined by connecting the start point and the end point through each of the sample points. Each of the candidate paths is defined as a spiral curve using a predetermined polynomial function such as a quintic polynomial function. For each of the candidate paths, a path cost is calculated using a predetermined cost function. The cost associated with a path may be determined based on a distance between the ADV and other obstacles and/or distance between the path and the boundary of the driving environment (e.g., lane or road boundary). One of the candidate paths is selected, where the selected candidate path has the lowest path cost amongst all the candidate paths, and also satisfies the boundary requirement. If a path does not satisfy the boundary requirement, the path will be removed from consideration to be selected as the final path for parking the vehicle. Thereafter, a trajectory is planned based on the selected candidate path.

In one embodiment, each of the candidate paths includes a forward path from the start point to a corresponding sample point and a backward path from the corresponding sample point and the end point. The forward path may be represented by a first spiral curve and the backward path may be represented by a second spiral curve. In one embodiment, the sample points are disposed on a line formed with an approximately 45 degrees with respect to a lane direction of the current lane in which the ADV is driving.

Referring to FIG. 4, a block diagram 400 illustrating various modules according to one embodiment is shown. A plurality of sample points 410 are determined. The plurality of sample points are located on a line that forms a 45-degree angle with a direction of a road lane in which the start point is located. In one embodiment, the line intersects with a corner between the road lane and the parking space. The endpoint is located within the parking space. A same distance separates any two neighboring sample points. Accordingly, it should be appreciated that the number of sample points can be calculated as: number_of_sample_numbers=√{square root over (2)}×lane_width/Δs, where Δs is the sample interval (i.e., the distance between any two neighboring sample points). A plurality of candidate paths 420 connecting a start point 412 and an endpoint 414 for vertical parking are determined, each of the candidate paths 420 passing through one of the sample points, wherein each candidate path comprises two connected spiral curves comprising a first spiral curve connecting the start point and the respective sample point and the second spiral curve connecting the respective sample point and the end point. The first spiral curve is associated with a forward movement of the ADV, and the second spiral curve is associated with a reverse movement of the ADV. In one embodiment, the first and second spiral curves are quintic spiral curves. In other words, each of the first and second spiral curves can be represented as (for the i-th spiral curve): θ_(i)(s)=as⁵+bs⁴+cs³+ds²+es+f, where a, b, c, d, e, and f are parameters that define the spiral curve.

A cost associated with each of the plurality of candidate paths is determined at a cost evaluation module 430. The cost comprises an obstacle cost, and is determined based at least in part on a distance between the ADV and each of one or more obstacles in a vicinity of the respective candidate path. Accordingly, the cost can be represented as: C=Σe^(−λ/dis), where λ is a tunable parameter that can be determined empirically, and dis is the distance between the respective obstacle and the ADV. One or more candidate paths from the plurality of candidate paths that meet a boundary check requirement are determined at a boundary check module 432. A candidate path associated with a lowest cost that meets the boundary check requirement is selected as the planned path at a path selection module 440. The boundary check requirement is met when a candidate path does not overlap with any solid line of the parking space.

A speed profile based on the planned path and an environment of the ADV is determined at a speed profile module 450. Determining the speed profile comprises determining zero, one, or more stopping points along the planned path. Further, driving signals are generated based at least in part on the speed profile to control operations of the ADV to perform vertical parking along the planned path. A safety buffer may be added based on the expected error when checking potential collisions with obstacles, so that the ADV does not collide with any obstacles. The ADV travels along the first spiral curve of the planned path in the forward direction, and along the second spiral curve of the planned path in the reverse direction. The modules that perform the operations at blocks 430, 432, 440, and 450 may be implemented as a part of parking planning module 308.

Referring to FIG. 5, a diagram illustrating an environment 500 where embodiments may be practiced is shown. A path for vertical parking is planned for the ADV 510. A plurality of sample points 520 a-d are determined on a line 540 that forms a 45-degree angle with a direction of a road lane 542 in which the start point 530 is located. The line 540 intersects with a corner between the road lane 542 and the parking space 544. A same distance separates any two neighboring sample points 520 a-d. Each of the start point 530, the end point 532, and the sample points 520 a-d is associated with a coordinate on a map and a heading, and the start point 530 is further associated with a speed and an acceleration of the ADV 510 at the start point 530.

A plurality of candidate paths (shown as dashed curves on FIG. 5) connecting the start point 530 and an end point 532 in the parking space 544 for vertical parking are determined, each of the candidate paths passing through one of the sample points 520 a-d, wherein each candidate path comprises two connected spiral curves comprising a first spiral curve connecting the start point 530 and the respective sample point 520 a-d and the second spiral curve connecting the respective sample point 520 a-d and the end point 532.

The first spiral curve is associated with a forward movement of the ADV 510, and the second spiral curve is associated with a reverse movement of the ADV 510. In one embodiment, the first and second spiral curves are quintic spiral curves. A planned path may be selected from the candidate paths, as described in detail above. Control signals may be generated accordingly to cause the ADV 510 to perform vertical parking traversing first the first spiral curve of the planned path in a forward movement and then the second spiral curve of the planned path in a reverse movement. When the vertical parking is complete, the ADV 510 is parked at the end point 532 with the desired heading (which is perpendicular to the direction of a road lane 542).

Referring to FIG. 6, a flowchart illustrating an example method 600 for planning a path for vertical parking in operating an autonomous driving vehicle (ADV) according to one embodiment is shown. The method 600 maybe implemented in hardware, software, or a combination of both. In one embodiment, the method 600 may be implemented at least in part at the vertical parking planning module 308. At block 610, a set of sample points are defined as intermediate points between a start point of an ADV and an endpoint within a parking space to park the ADV. At block 620, a set of candidate paths are determined, where each of the candidate paths connects the start point to the end point through one of the intermediate points.

At block 630, for each of the candidate paths, a path cost is calculated using a predetermined cost function. At block 640, one of the candidate paths is selected, for example, based on a set of selection rules. In one embodiment, the selected candidate path has the lowest path cost amongst the candidate paths. In addition, the selected candidate path must satisfy a boundary requirement of the driving environment. At block 650, a trajectory is planned based on the selected candidate path to park the ADV into the parking space.

Note that some or all of the components as shown and described above may be implemented in software, hardware, or a combination thereof. For example, such components can be implemented as software installed and stored in a persistent storage device, which can be loaded and executed in a memory by a processor (not shown) to carry out the processes or operations described throughout this application. Alternatively, such components can be implemented as executable code programmed or embedded into dedicated hardware such as an integrated circuit (e.g., an application specific IC or ASIC), a digital signal processor (DSP), or a field programmable gate array (FPGA), which can be accessed via a corresponding driver and/or operating system from an application. Furthermore, such components can be implemented as specific hardware logic in a processor or processor core as part of an instruction set accessible by a software component via one or more specific instructions.

FIG. 7 is a block diagram illustrating an example of a data processing system which may be used with one embodiment of the disclosure. For example, system 1500 may represent any of data processing systems described above performing any of the processes or methods described above, such as, for example, perception and planning system 110 or any of servers 103-104 of FIG. 1. System 1500 can include many different components. These components can be implemented as integrated circuits (ICs), portions thereof, discrete electronic devices, or other modules adapted to a circuit board such as a motherboard or add-in card of the computer system, or as components otherwise incorporated within a chassis of the computer system.

Note also that system 1500 is intended to show a high level view of many components of the computer system. However, it is to be understood that additional components may be present in certain implementations and furthermore, different arrangement of the components shown may occur in other implementations. System 1500 may represent a desktop, a laptop, a tablet, a server, a mobile phone, a media player, a personal digital assistant (PDA), a Smartwatch, a personal communicator, a gaming device, a network router or hub, a wireless access point (AP) or repeater, a set-top box, or a combination thereof. Further, while only a single machine or system is illustrated, the term “machine” or “system” shall also be taken to include any collection of machines or systems that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein.

In one embodiment, system 1500 includes processor 1501, memory 1503, and devices 1505-1508 connected via a bus or an interconnect 1510. Processor 1501 may represent a single processor or multiple processors with a single processor core or multiple processor cores included therein. Processor 1501 may represent one or more general-purpose processors such as a microprocessor, a central processing unit (CPU), or the like. More particularly, processor 1501 may be a complex instruction set computing (CISC) microprocessor, reduced instruction set computing (RISC) microprocessor, very long instruction word (VLIW) microprocessor, or processor implementing other instruction sets, or processors implementing a combination of instruction sets. Processor 1501 may also be one or more special-purpose processors such as an application specific integrated circuit (ASIC), a cellular or baseband processor, a field programmable gate array (FPGA), a digital signal processor (DSP), a network processor, a graphics processor, a communications processor, a cryptographic processor, a co-processor, an embedded processor, or any other type of logic capable of processing instructions.

Processor 1501, which may be a low power multi-core processor socket such as an ultra-low voltage processor, may act as a main processing unit and central hub for communication with the various components of the system. Such processor can be implemented as a system on chip (SoC). Processor 1501 is configured to execute instructions for performing the operations and steps discussed herein. System 1500 may further include a graphics interface that communicates with optional graphics subsystem 1504, which may include a display controller, a graphics processor, and/or a display device.

Processor 1501 may communicate with memory 1503, which in one embodiment can be implemented via multiple memory devices to provide for a given amount of system memory. Memory 1503 may include one or more volatile storage (or memory) devices such as random access memory (RAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), static RAM (SRAM), or other types of storage devices. Memory 1503 may store information including sequences of instructions that are executed by processor 1501, or any other device. For example, executable code and/or data of a variety of operating systems, device drivers, firmware (e.g., input output basic system or BIOS), and/or applications can be loaded in memory 1503 and executed by processor 1501. An operating system can be any kind of operating systems, such as, for example, Robot Operating System (ROS), Windows® operating system from Microsoft®, Mac OS/iOS® from Apple, Android® from Google®, LINUX, UNIX, or other real-time or embedded operating systems.

System 1500 may further include IO devices such as devices 1505-1508, including network interface device(s) 1505, optional input device(s) 1506, and other optional IO device(s) 1507. Network interface device 1505 may include a wireless transceiver and/or a network interface card (NIC). The wireless transceiver may be a WiFi transceiver, an infrared transceiver, a Bluetooth transceiver, a WiMax transceiver, a wireless cellular telephony transceiver, a satellite transceiver (e.g., a global positioning system (GPS) transceiver), or other radio frequency (RF) transceivers, or a combination thereof. The NIC may be an Ethernet card.

Input device(s) 1506 may include a mouse, a touch pad, a touch sensitive screen (which may be integrated with display device 1504), a pointer device such as a stylus, and/or a keyboard (e.g., physical keyboard or a virtual keyboard displayed as part of a touch sensitive screen) . For example, input device 1506 may include a touch screen controller coupled to a touch screen. The touch screen and touch screen controller can, for example, detect contact and movement or break thereof using any of a plurality of touch sensitivity technologies, including but not limited to capacitive, resistive, infrared, and surface acoustic wave technologies, as well as other proximity sensor arrays or other elements for determining one or more points of contact with the touch screen.

IO devices 1507 may include an audio device. An audio device may include a speaker and/or a microphone to facilitate voice-enabled functions, such as voice recognition, voice replication, digital recording, and/or telephony functions. Other IO devices 1507 may further include universal serial bus (USB) port(s), parallel port(s), serial port(s), a printer, a network interface, a bus bridge (e.g., a PCI-PCI bridge), sensor(s) (e.g., a motion sensor such as an accelerometer, gyroscope, a magnetometer, a light sensor, compass, a proximity sensor, etc.), or a combination thereof. Devices 1507 may further include an imaging processing subsystem (e.g., a camera), which may include an optical sensor, such as a charged coupled device (CCD) or a complementary metal-oxide semiconductor (CMOS) optical sensor, utilized to facilitate camera functions, such as recording photographs and video clips. Certain sensors may be coupled to interconnect 1510 via a sensor hub (not shown), while other devices such as a keyboard or thermal sensor may be controlled by an embedded controller (not shown), dependent upon the specific configuration or design of system 1500.

To provide for persistent storage of information such as data, applications, one or more operating systems and so forth, a mass storage (not shown) may also couple to processor 1501. In various embodiments, to enable a thinner and lighter system design as well as to improve system responsiveness, this mass storage may be implemented via a solid state device (SSD). However in other embodiments, the mass storage may primarily be implemented using a hard disk drive (HDD) with a smaller amount of SSD storage to act as a SSD cache to enable non-volatile storage of context state and other such information during power down events so that a fast power up can occur on re-initiation of system activities. Also a flash device may be coupled to processor 1501, e.g., via a serial peripheral interface (SPI). This flash device may provide for non-volatile storage of system software, including BIOS as well as other firmware of the system.

Storage device 1508 may include computer-accessible storage medium 1509 (also known as a machine-readable storage medium or a computer-readable medium) on which is stored one or more sets of instructions or software (e.g., module, unit, and/or logic 1528) embodying any one or more of the methodologies or functions described herein. Processing module/unit/logic 1528 may represent any of the components described above, such as, for example, planning module 305, control module 306, vertical parking planning module 308. Processing module/unit/logic 1528 may also reside, completely or at least partially, within memory 1503 and/or within processor 1501 during execution thereof by data processing system 1500, memory 1503 and processor 1501 also constituting machine-accessible storage media. Processing module/unit/logic 1528 may further be transmitted or received over a network via network interface device 1505.

Computer-readable storage medium 1509 may also be used to store the some software functionalities described above persistently. While computer-readable storage medium 1509 is shown in an exemplary embodiment to be a single medium, the term “computer-readable storage medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The terms “computer-readable storage medium” shall also be taken to include any medium that is capable of storing or encoding a set of instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present disclosure. The term “computer-readable storage medium” shall accordingly be taken to include, but not be limited to, solid-state memories, and optical and magnetic media, or any other non-transitory machine-readable medium.

Processing module/unit/logic 1528, components and other features described herein can be implemented as discrete hardware components or integrated in the functionality of hardware components such as ASICS, FPGAs, DSPs or similar devices. In addition, processing module/unit/logic 1528 can be implemented as firmware or functional circuitry within hardware devices. Further, processing module/unit/logic 1528 can be implemented in any combination hardware devices and software components.

Note that while system 1500 is illustrated with various components of a data processing system, it is not intended to represent any particular architecture or manner of interconnecting the components; as such details are not germane to embodiments of the present disclosure. It will also be appreciated that network computers, handheld computers, mobile phones, servers, and/or other data processing systems which have fewer components or perhaps more components may also be used with embodiments of the disclosure.

Some portions of the preceding detailed descriptions have been presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the ways used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities.

It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the above discussion, it is appreciated that throughout the description, discussions utilizing terms such as those set forth in the claims below, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.

Embodiments of the disclosure also relate to an apparatus for performing the operations herein. Such a computer program is stored in a non-transitory computer readable medium. A machine-readable medium includes any mechanism for storing information in a form readable by a machine (e.g., a computer). For example, a machine-readable (e.g., computer-readable) medium includes a machine (e.g., a computer) readable storage medium (e.g., read only memory (“ROM”), random access memory (“RAM”), magnetic disk storage media, optical storage media, flash memory devices).

The processes or methods depicted in the preceding figures maybe performed by processing logic that comprises hardware (e.g. circuitry, dedicated logic, etc.), software (e.g., embodied on a non-transitory computer readable medium), or a combination of both. Although the processes or methods are described above in terms of some sequential operations, it should be appreciated that some of the operations described may be performed in a different order. Moreover, some operations may be performed in parallel rather than sequentially.

Embodiments of the present disclosure are not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of embodiments of the disclosure as described herein.

In the foregoing specification, embodiments of the disclosure have been described with reference to specific exemplary embodiments thereof. It will be evident that various modifications may be made thereto without departing from the broader spirit and scope of the disclosure as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense. 

What is claimed is:
 1. A computer-implemented method for planning a path for parking in operating an autonomous driving vehicle (ADV), the method comprising: defining a plurality of sample points as intermediate points between a start point and an end point within a parking space to park the ADV; determining a plurality of candidate paths connecting the start point and the end point through each of the sample points, wherein each of the candidate paths is defined as a spiral curve using a polynomial function; for each of the candidate paths, calculating a path cost using a predetermined cost function; selecting one of the candidate paths having a lowest path cost amongst the candidate paths; and planning a trajectory according to the selected candidate path to park the ADV into the parking space.
 2. The method of claim 1, wherein each of the candidate paths including a forward path between the start point and one of the sample points and a backward path between one of the sample points and the end point.
 3. The method of claim 1, wherein determining a plurality of candidate paths comprises: for each of the candidate paths, defining a first spiral curve connecting the start point and a corresponding sample point; and defining a second spiral curve connecting the corresponding sample point and the end point.
 4. The method of claim 1, wherein determining a plurality of candidate paths comprises: determining a lane configuration of a road in which the ADV is driving based on perception data perceiving the driving environment surrounding the ADV; calculating a boundary requirement associated with the lane configuration; and for each of the candidate paths, determining whether the candidate path satisfies boundary requirement, wherein the selected candidate path satisfies the boundary requirement.
 5. The method of claim 4, further comprising removing any candidate path that does not satisfy the boundary requirement from consideration for selection.
 6. The method of claim 1, wherein the plurality of sample points are located on a line that is disposed with an approximately 45-degree angle with respect to a lane direction of a lane in which the start point is located.
 7. The method of claim 1, wherein the path cost is determined based at least in part on a distance between the ADV and one or more obstacles perceived within a predetermined proximity of the ADV.
 8. The method of claim 7, wherein the path cost is determined further based on a distance between a corresponding candidate path and a lane boundary of a lane through which the candidate path extends.
 9. A non-transitory machine-readable medium having instructions stored therein, which when executed by a processor, cause the processor to perform operations for planning a path for parking in operating an autonomous driving vehicle (ADV), the operations comprising: defining a plurality of sample points as intermediate points between a start point and an end point within a parking space to park the ADV; determining a plurality of candidate paths connecting the start point and the end point through each of the sample points, wherein each of the candidate paths is defined as a spiral curve using a polynomial function; for each of the candidate paths, calculating a path cost using a predetermined cost function; selecting one of the candidate paths having a lowest path cost amongst the candidate paths; and planning a trajectory according to the selected candidate path to park the ADV into the parking space.
 10. The machine-readable medium of claim 9, wherein each of the candidate paths including a forward path between the start point and one of the sample points and a backward path between one of the sample points and the end point.
 11. The machine-readable medium of claim 9, wherein determining a plurality of candidate paths comprises: for each of the candidate paths, defining a first spiral curve connecting the start point and a corresponding sample point; and defining a second spiral curve connecting the corresponding sample point and the end point.
 12. The machine-readable medium of claim 9, wherein determining a plurality of candidate paths comprises: determining a lane configuration of a road in which the ADV is driving based on perception data perceiving the driving environment surrounding the ADV; calculating a boundary requirement associated with the lane configuration; and for each of the candidate paths, determining whether the candidate path satisfies boundary requirement, wherein the selected candidate path satisfies the boundary requirement.
 13. The machine-readable medium of claim 12, wherein the operations further comprise removing any candidate path that does not satisfy the boundary requirement from consideration for selection.
 14. The machine-readable medium of claim 9, wherein the plurality of sample points are located on a line that is disposed with an approximately 45-degree angle with respect to a lane direction of a lane in which the start point is located.
 15. The machine-readable medium of claim 9, wherein the path cost is determined based at least in part on a distance between the ADV and one or more obstacles perceived within a predetermined proximity of the ADV.
 16. The machine-readable medium of claim 15, wherein the path cost is determined further based on a distance between a corresponding candidate path and a lane boundary of a lane through which the candidate path extends.
 17. A data processing system, comprising: a processor; and a memory coupled to the processor to store instructions, which when executed by the processor, cause the processor to perform operations for planning a path for parking in operating an autonomous driving vehicle (ADV), the operations including: defining a plurality of sample points as intermediate points between a start point and an endpoint within a parking space to park the ADV, determining a plurality of candidate paths connecting the start point and the end point through each of the sample points, wherein each of the candidate paths is defined as a spiral curve using a polynomial function, for each of the candidate paths, calculating a path cost using a predetermined cost function, selecting one of the candidate paths having a lowest path cost amongst the candidate paths, and planning a trajectory according to the selected candidate path to park the ADV into the parking space.
 18. The system of claim 17, wherein each of the candidate paths including a forward path between the start point and one of the sample points and a backward path between one of the sample points and the end point.
 19. The system of claim 17, wherein determining a plurality of candidate paths comprises: for each of the candidate paths, defining a first spiral curve connecting the start point and a corresponding sample point; and defining a second spiral curve connecting the corresponding sample point and the end point.
 20. The system of claim 17, wherein determining a plurality of candidate paths comprises: determining a lane configuration of a road in which the ADV is driving based on perception data perceiving the driving environment surrounding the ADV; calculating a boundary requirement associated with the lane configuration; and for each of the candidate paths, determining whether the candidate path satisfies boundary requirement, wherein the selected candidate path satisfies the boundary requirement.
 21. The system of claim 20, wherein the operations further comprise removing any candidate path that does not satisfy the boundary requirement from consideration for selection. 